Approximating the Radii of Point Sets
نویسندگان
چکیده
We consider the problem of computing the outer-radii of point sets. In this problem, we are given integers n, d, k where k ≤ d, and a set P of n points in R. The goal is to compute the outer k-radius of P , denoted by Rk(P ), which is the minimum, over all (d − k)-dimensional flats F , of maxp∈P d(p, F ), where d(p, F ) is the Euclidean distance between the point p and flat F . Computing the radii of point sets is a fundamental problem in computational convexity with significantly many applications. The problem admits a polynomial time algorithm when the dimension d is constant [15]. Here we are interested in the general case when the dimension d is not fixed and can be as large as n, where the problem becomes NP-hard even for k = 1. It is known that Rk(P ) can be approximated in polynomial time by a factor of (1 + ε), for any ε > 0, when d − k is a fixed constant [22, 7]. A Research by the first author is supported by NSF CAREER award CCR-0237431. Research by the second author is supported by an NSERC discovery grant. Research by the third and fourth authors is supported by NSF grant DMI-0231600. A preliminary version of this paper appeared as : (i) K. R. Varadarajan, S. Venkatesh, and J. Zhang, Approximating the radii of point sets in high dimensions, Proc. 43rd IEEE Symp. Found. Comput. Sci., 2002, and (ii) Y. Ye and J. Zhang, An improved algorithm for approximating the radii of point sets, Proc. APPROX, 2003. Department of Computer Science, The University of Iowa, Iowa City, IA 52242-1419, email: [email protected], www: http://www.cs.uiowa.edu/ ̃kvaradar/ Department of Computer Science, University of Victoria, PO Box 3055, STN CSC, Victoria, BC, Canada V8W 3P6, email: [email protected], www: http://www.cs.uvic.ca/ ̃venkat Management Science and Engineering and, by courtesy, Electrical Engineering, Stanford University, Stanford, CA 94305, USA, email: [email protected] www: http://www.stanford.edu/ ̃yyye/ IOMS-Operations Management, Stern School of Business, New York University, 44 W. 4th Street, Suite 8-66, New York, NY 10012-1126, email: [email protected] www: www.stern.nyu.edu/ ̃jzhang
منابع مشابه
Propagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملAn Improved Algorithm for Approximating the Radii of Point Sets
We consider the problem of computing the outer-radii of point sets. In this problem, we are given integers n, d, k where k ≤ d, and a set P of n points in R. The goal is to compute the outer k-radius of P , denoted by Rk(P ), which is the minimum, over all (d−k)-dimensional flats F , of maxp∈P d(p, F ), where d(p, F ) is the Euclidean distance between the point p and flat F . Computing the radi...
متن کاملNotes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs
We present simple methods for approximating the diameters, radii, and centers of finite sets in δ-hyperbolic geodesic spaces and graphs. We also provide a simple construction of distance approximating trees of δ-hyperbolic graphs G on n vertices with an additive error O(δ log2 n) comparable with that given by M. Gromov.
متن کاملApproximating the step change point of the process fraction non conforming using genetic algorithm to optimize the likelihood function
Control charts are standard statistical process control (SPC) tools for detecting assignable causes. These charts trigger a signal when a process gets out of control but they do not indicate when the process change has begun. Identifying the real time of the change in the process, called the change point, is very important for eliminating the source(s) of the change. Knowing when a process has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 36 شماره
صفحات -
تاریخ انتشار 2007